________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 21:23:00
Input Data from:  dataset156.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,151
Average f[i]   :4525
Average g[i,j] :1984,3137254902
Total demand   :10540
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 41
> Selected Move:	4730	1	-1	6	5500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 4730


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 55
> Selected Move:	6090	1	-1	15	12000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0    >new incumb.: 6090


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 38
> Selected Move:	7320	1	-1	18	17500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0    >new incumb.: 7320


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 38
> Selected Move:	7940	1	-1	10	22000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  1  0    >new incumb.: 7940


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 53
> Selected Move:	7970	3	2	3	23900


> New Y[]: 
	
	 2  3  0  4  0  0  1  0  0  0  1  0  0  0  0  1  0  0  1  0    >new incumb.: 7970


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 36
> Selected Move:	8140	3	15	12	21400


> New Y[]: 
	
	 2  3  0  4  0  0  1  0  0  0  1  0  1  0  0  0  0  0  1  0    >new incumb.: 8140


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 36
> Selected Move:	8210	1	-1	7	25400


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 29
> Selected Move:	8370	3	3	2	23500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  1  0  1  0  0  0  0  0  1  0    >new incumb.: 8370


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 43
> Selected Move:	8340	3	12	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 41
> Selected Move:	8240	3	6	19	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 69
> Selected Move:	8270	3	4	12	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 78
> Selected Move:	8250	3	7	5	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 24
> Selected Move:	8250	3	19	6	24500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 79
> Selected Move:	8200	3	5	19	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 82
> Selected Move:	8180	3	6	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 23
> Selected Move:	8180	3	19	6	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 50
> Selected Move:	8180	3	6	7	23000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 37
> Selected Move:	8250	3	4	15	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  1  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 42
> Selected Move:	8210	3	15	3	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 28
> Selected Move:	8160	3	3	5	23000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 75
> Selected Move:	8300	3	2	3	24900


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 55
> Selected Move:	8300	3	5	16	24900


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  0  0  1  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 20
> Selected Move:	8360	3	3	6	24600


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  0  0  1  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 25
> Selected Move:	8320	3	16	8	24100


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  1  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 29
> Selected Move:	8320	4	6	18	24700


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  1  0  1  0  0  0  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 33
> Selected Move:	8279	3	8	16	25200


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  1  0  0  0  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 22
> Selected Move:	8260	3	18	5	24900


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 53
> Selected Move:	8260	4	5	6	24100


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 62
> Selected Move:	8221	4	6	16	25100


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0  1  0  1  0  0  0  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 58
> Selected Move:	8240	3	16	3	24900


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 50
> Selected Move:	8240	3	6	19	24900


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 59
> Selected Move:	8260	3	5	18	25400


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  0  0  1  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 57
> Selected Move:	8140	2	7	-1	21400


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 17
> Selected Move:	8140	4	3	10	23700


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  4  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 16
> Selected Move:	8140	4	10	12	24100


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  4  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 15
> Selected Move:	8140	4	12	18	22700


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 19
> Selected Move:	8140	4	18	19	22900


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 22
> Selected Move:	8140	3	19	6	22100


> New Y[]: 
	
	 2  3  0  1  0  0  4  0  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 37
> Selected Move:	8140	4	6	10	23700


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  4  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 31
> Selected Move:	8140	4	10	12	24100


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  4  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 28
> Selected Move:	8140	4	12	18	22700


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 39
> Selected Move:	8110	3	1	14	24400


> New Y[]: 
	
	 2  0  0  1  0  0  1  0  0  0  1  0  1  0  3  0  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 27
> Selected Move:	8110	4	14	3	24200


> New Y[]: 
	
	 2  0  0  3  0  0  1  0  0  0  1  0  1  0  1  0  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 27
> Selected Move:	8110	4	3	18	24200


> New Y[]: 
	
	 2  0  0  4  0  0  1  0  0  0  1  0  1  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 27
> Selected Move:	8110	4	3	6	24900


> New Y[]: 
	
	 2  0  0  1  0  0  4  0  0  0  1  0  1  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 26
> Selected Move:	8110	4	6	14	24200


> New Y[]: 
	
	 2  0  0  1  0  0  1  0  0  0  1  0  1  0  4  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 28
> Selected Move:	8110	4	18	3	22900


> New Y[]: 
	
	 2  0  0  3  0  0  1  0  0  0  1  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 31
> Selected Move:	8110	4	3	6	23900


> New Y[]: 
	
	 2  0  0  1  0  0  3  0  0  0  1  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 30
> Selected Move:	8110	4	6	14	23800


> New Y[]: 
	
	 2  0  0  1  0  0  4  0  0  0  1  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 28
> Selected Move:	8110	4	6	3	23100


> New Y[]: 
	
	 2  0  0  4  0  0  1  0  0  0  1  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 29
> Selected Move:	8110	4	14	6	23900


> New Y[]: 
	
	 2  0  0  4  0  0  3  0  0  0  1  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 29
> Selected Move:	8110	4	3	6	23600


> New Y[]: 
	
	 2  0  0  3  0  0  4  0  0  0  1  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 31
> Selected Move:	8110	3	6	19	24400


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  1  0  1  0  1  0  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 16
> Selected Move:	8110	4	3	14	24600


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  0  3  0  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 17
> Selected Move:	8110	4	14	19	23900


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  0  4  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 16
> Selected Move:	8110	4	14	3	23900


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  0  0  1  0  1  0  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 18
> Selected Move:	8110	4	19	14	23100


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  0  0  1  0  1  0  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 19
> Selected Move:	8110	4	3	14	22900


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  1  0  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 19
> Selected Move:	8110	4	3	18	24200


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  0  4  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 16
> Selected Move:	8110	4	14	3	24200


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  0  0  1  0  1  0  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 17
> Selected Move:	8110	4	3	18	24200


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  1  0  1  0  1  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 17
> Selected Move:	8110	4	3	14	24400


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  0  3  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 17
> Selected Move:	8066	4	14	19	25200


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  0  1  0  0  0  4  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 19
> Selected Move:	8067	3	19	6	25200


> New Y[]: 
	
	 2  0  0  1  0  0  3  0  0  0  1  0  1  0  1  0  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 35
> Selected Move:	7960	3	3	16	23700


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  0  1  0  1  0  1  0  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 49
> Selected Move:	7960	4	6	14	22900


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  1  0  3  0  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 50
> Selected Move:	8070	1	-1	7	26900


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  1  0  1  0  3  0  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 27
> Selected Move:	8197	4	18	6	26300


> New Y[]: 
	
	 2  0  0  0  0  0  4  1  0  0  1  0  1  0  3  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 31
> Selected Move:	8198	3	18	5	25800


> New Y[]: 
	
	 2  0  0  0  0  1  4  1  0  0  1  0  1  0  3  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 69 #######################


> Neighbours evaluated; 75
> Selected Move:	8175	4	6	14	25900


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  0  0  1  0  1  0  4  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 70 #######################


> Neighbours evaluated; 73
> Selected Move:	8170	3	5	18	26400


> New Y[]: 
	
	 2  0  0  0  0  0  3  1  0  0  1  0  1  0  4  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,205

## ITERATION 71 #######################


> Neighbours evaluated; 32
> Selected Move:	8136	3	16	8	25900


> New Y[]: 
	
	 2  0  0  0  0  0  3  1  1  0  1  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 72 #######################


> Neighbours evaluated; 30
> Selected Move:	8152	4	6	14	25800


> New Y[]: 
	
	 2  0  0  0  0  0  4  1  1  0  1  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 73 #######################


> Neighbours evaluated; 32
> Selected Move:	8130	3	6	15	25700


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  1  0  1  0  1  0  3  4  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 74 #######################


> Neighbours evaluated; 31
> Selected Move:	8280	3	14	1	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  4  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 75 #######################


> Neighbours evaluated; 40
> Selected Move:	8280	3	8	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  4  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 76 #######################


> Neighbours evaluated; 37
> Selected Move:	8267	3	15	6	25100


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  0  0  1  0  1  0  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 77 #######################


> Neighbours evaluated; 34
> Selected Move:	8152	3	17	3	26100


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 78 #######################


> Neighbours evaluated; 38
> Selected Move:	8150	3	3	9	24600


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  0  1  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 79 #######################


> Neighbours evaluated; 32
> Selected Move:	8140	3	6	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  1  0  1  0  0  4  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 80 #######################


> Neighbours evaluated; 34
> Selected Move:	8160	3	9	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  4  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 81 #######################


> Neighbours evaluated; 30
> Selected Move:	8228	3	15	19	25400


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 82 #######################


> Neighbours evaluated; 47
> Selected Move:	8278	4	19	18	25200


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 83 #######################


> Neighbours evaluated; 58
> Selected Move:	8220	3	16	8	24700


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 84 #######################


> Neighbours evaluated; 57
> Selected Move:	8220	4	18	19	24900


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  0  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 85 #######################


> Neighbours evaluated; 65
> Selected Move:	8130	3	19	4	24800


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  1  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 86 #######################


> Neighbours evaluated; 30
> Selected Move:	8130	4	4	18	24200


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  0  1  0  1  0  0  0  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 87 #######################


> Neighbours evaluated; 29
> Selected Move:	8160	3	8	16	24700


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  0  1  0  0  0  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 88 #######################


> Neighbours evaluated; 18
> Selected Move:	8220	3	4	5	24700


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  1  0  0  0  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 89 #######################


> Neighbours evaluated; 62
> Selected Move:	8220	4	18	5	24900


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  0  0  1  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 90 #######################


> Neighbours evaluated; 60
> Selected Move:	8197	4	5	16	25100


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  1  0  0  0  4  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 91 #######################


> Neighbours evaluated; 64
> Selected Move:	8225	3	5	6	25600


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  1  0  0  0  4  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 92 #######################


> Neighbours evaluated; 26
> Selected Move:	8198	3	6	19	25600


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  0  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 93 #######################


> Neighbours evaluated; 65
> Selected Move:	8139	3	18	5	25100


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  1  0  0  0  4  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 94 #######################


> Neighbours evaluated; 61
> Selected Move:	8160	4	16	5	24900


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  0  0  1  0  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 95 #######################


> Neighbours evaluated; 68
> Selected Move:	8160	4	5	19	24900


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  1  0  0  0  1  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 96 #######################


> Neighbours evaluated; 79
> Selected Move:	8130	3	19	3	24400


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 97 #######################


> Neighbours evaluated; 80
> Selected Move:	8002	3	10	18	25400


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  0  0  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 98 #######################


> Neighbours evaluated; 62
> Selected Move:	8090	3	3	6	25100


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  0  0  0  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 99 #######################


> Neighbours evaluated; 72
> Selected Move:	8107	3	5	13	25600


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  0  0  0  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 100 #######################


> Neighbours evaluated; 61
> Selected Move:	8239	3	16	8	25100


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  1  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 101 #######################


> Neighbours evaluated; 58
> Selected Move:	8260	4	6	13	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  0  0  1  4  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 102 #######################


> Neighbours evaluated; 65
> Selected Move:	8166	3	13	10	25700


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  4  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 103 #######################


> Neighbours evaluated; 23
> Selected Move:	8185	4	10	8	25600


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  4  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 104 #######################


> Neighbours evaluated; 32
> Selected Move:	8127	3	18	5	25100


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 105 #######################


> Neighbours evaluated; 58
> Selected Move:	8200	3	8	2	23000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 106 #######################


> Neighbours evaluated; 79
> Selected Move:	8200	3	1	14	24700


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  0  0  1  0  1  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 107 #######################


> Neighbours evaluated; 61
> Selected Move:	8321	3	5	18	25200


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  1  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 108 #######################


> Neighbours evaluated; 32
> Selected Move:	8220	3	6	19	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  1  0  1  0  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 109 #######################


> Neighbours evaluated; 67
> Selected Move:	8180	3	19	4	24700


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  1  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 110 #######################


> Neighbours evaluated; 33
> Selected Move:	8160	3	4	5	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  1  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 111 #######################


> Neighbours evaluated; 76
> Selected Move:	8100	3	18	19	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  1  0  1  0  3  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 112 #######################


> Neighbours evaluated; 76
> Selected Move:	8100	3	14	1	23000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 113 #######################


> Neighbours evaluated; 90
> Selected Move:	8100	3	12	4	24000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 114 #######################


> Neighbours evaluated; 88
> Selected Move:	8200	3	19	6	24000


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 115 #######################


> Neighbours evaluated; 104
> Selected Move:	8150	3	10	13	25000


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 116 #######################


> Neighbours evaluated; 90
> Selected Move:	8185	3	5	18	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 117 #######################


> Neighbours evaluated; 74
> Selected Move:	8310	3	4	12	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 118 #######################


> Neighbours evaluated; 84
> Selected Move:	8210	3	6	19	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 119 #######################


> Neighbours evaluated; 99
> Selected Move:	8120	3	19	4	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 120 #######################


> Neighbours evaluated; 72
> Selected Move:	8095	3	12	19	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 121 #######################


> Neighbours evaluated; 93
> Selected Move:	8090	3	13	5	25000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 122 #######################


> Neighbours evaluated; 92
> Selected Move:	8110	3	19	6	25000


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 123 #######################


> Neighbours evaluated; 87
> Selected Move:	8150	3	4	12	24000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 124 #######################


> Neighbours evaluated; 87
> Selected Move:	8150	3	18	13	24000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 125 #######################


> Neighbours evaluated; 97
> Selected Move:	8050	3	6	19	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 126 #######################


> Neighbours evaluated; 102
> Selected Move:	8090	3	13	18	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 127 #######################


> Neighbours evaluated; 97
> Selected Move:	8040	3	19	15	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 128 #######################


> Neighbours evaluated; 84
> Selected Move:	8095	3	5	13	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 129 #######################


> Neighbours evaluated; 81
> Selected Move:	8058	3	15	3	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 130 #######################


> Neighbours evaluated; 72
> Selected Move:	8030	3	13	5	25000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 131 #######################


> Neighbours evaluated; 71
> Selected Move:	8040	3	18	10	24000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 132 #######################


> Neighbours evaluated; 63
> Selected Move:	8138	3	2	6	25600


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 133 #######################


> Neighbours evaluated; 69
> Selected Move:	8154	3	7	18	27100


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 134 #######################


> Neighbours evaluated; 60
> Selected Move:	8276	4	6	3	26400


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 135 #######################


> Neighbours evaluated; 67
> Selected Move:	8269	3	6	19	26400


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  0  0  1  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,17

## ITERATION 136 #######################


> Neighbours evaluated; 22
> Selected Move:	8072	3	5	16	26400


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  1  0  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,175

## ITERATION 137 #######################


> Neighbours evaluated; 22
> Selected Move:	8068	3	3	7	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  0  0  1  0  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 138 #######################


> Neighbours evaluated; 58
> Selected Move:	8114	4	7	10	26200


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  4  0  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 139 #######################


> Neighbours evaluated; 65
> Selected Move:	8138	3	10	13	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  4  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 140 #######################


> Neighbours evaluated; 81
> Selected Move:	8160	3	16	8	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  4  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 141 #######################


> Neighbours evaluated; 84
> Selected Move:	8084	3	13	10	25700


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  4  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 142 #######################


> Neighbours evaluated; 61
> Selected Move:	8100	4	10	8	25600


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  4  0  1  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 143 #######################


> Neighbours evaluated; 61
> Selected Move:	8110	3	19	4	25100


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  4  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 144 #######################


> Neighbours evaluated; 29
> Selected Move:	8139	3	8	16	25100


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  0  1  0  0  0  4  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 145 #######################


> Neighbours evaluated; 25
> Selected Move:	8096	4	16	4	25300


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  0  0  1  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 146 #######################


> Neighbours evaluated; 26
> Selected Move:	8050	3	4	9	24800


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  4  1  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 147 #######################


> Neighbours evaluated; 27
> Selected Move:	8083	3	16	6	25300


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  4  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 148 #######################


> Neighbours evaluated; 27
> Selected Move:	8104	4	9	18	25200


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  1  1  0  1  0  0  0  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 149 #######################


> Neighbours evaluated; 34
> Selected Move:	8126	3	9	17	25700


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  1  0  0  0  0  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 150 #######################


> Neighbours evaluated; 35
> Selected Move:	8052	3	6	4	25200


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  0  1  0  0  0  0  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 151 #######################


> Neighbours evaluated; 30
> Selected Move:	8031	3	4	5	25200


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 152 #######################


> Neighbours evaluated; 61
> Selected Move:	8110	3	17	8	24200


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  1  0  0  0  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 153 #######################


> Neighbours evaluated; 65
> Selected Move:	8150	3	18	6	23600


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 154 #######################


> Neighbours evaluated; 69
> Selected Move:	8174	3	7	18	25100


> New Y[]: 
	
	 2  3  0  0  0  1  4  0  1  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 155 #######################


> Neighbours evaluated; 68
> Selected Move:	8104	3	5	4	25100


> New Y[]: 
	
	 2  3  0  0  1  0  4  0  1  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 156 #######################


> Neighbours evaluated; 43
> Selected Move:	8263	3	12	7	25100


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,275

## ITERATION 157 #######################


> Neighbours evaluated; 35
> Selected Move:	8235	3	8	16	25600


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 158 #######################


> Neighbours evaluated; 26
> Selected Move:	8232	3	18	5	25100


> New Y[]: 
	
	 2  3  0  0  1  1  4  1  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 159 #######################


> Neighbours evaluated; 69
> Selected Move:	8150	3	16	8	24600


> New Y[]: 
	
	 2  3  0  0  1  1  4  1  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 160 #######################


> Neighbours evaluated; 78
> Selected Move:	8034	4	6	5	25400


> New Y[]: 
	
	 2  3  0  0  1  4  1  1  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 161 #######################


> Neighbours evaluated; 62
> Selected Move:	8150	3	4	12	24400


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 162 #######################


> Neighbours evaluated; 59
> Selected Move:	8110	3	6	18	24400


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  1  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 163 #######################


> Neighbours evaluated; 58
> Selected Move:	8080	4	5	8	25100


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  4  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 164 #######################


> Neighbours evaluated; 50
> Selected Move:	8048	4	8	10	25200


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  4  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 165 #######################


> Neighbours evaluated; 55
> Selected Move:	8087	3	18	6	25200


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0  4  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 166 #######################


> Neighbours evaluated; 57
> Selected Move:	8100	3	10	13	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0  0  0  1  4  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 167 #######################


> Neighbours evaluated; 66
> Selected Move:	8100	4	13	6	24600


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  1  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 168 #######################


> Neighbours evaluated; 68
> Selected Move:	8060	3	6	15	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  1  0  4  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 169 #######################


> Neighbours evaluated; 76
> Selected Move:	8220	3	5	18	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  1  0  4  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 170 #######################


> Neighbours evaluated; 65
> Selected Move:	8120	3	18	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  0  0  1  1  0  4  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 171 #######################


> Neighbours evaluated; 67
> Selected Move:	8120	3	6	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  1  0  4  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 172 #######################


> Neighbours evaluated; 71
> Selected Move:	8030	3	13	18	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  0  4  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 173 #######################


> Neighbours evaluated; 62
> Selected Move:	8128	3	7	10	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  0  0  4  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 174 #######################


> Neighbours evaluated; 22
> Selected Move:	8130	3	19	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  1  0  0  4  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 175 #######################


> Neighbours evaluated; 45
> Selected Move:	8173	3	12	7	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  1  0  0  0  0  4  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 176 #######################


> Neighbours evaluated; 41
> Selected Move:	8150	3	18	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0  1  0  0  0  0  4  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 177 #######################


> Neighbours evaluated; 47
> Selected Move:	8118	3	8	16	25500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0  1  0  0  0  0  4  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,28

## ITERATION 178 #######################


> Neighbours evaluated; 71
> Selected Move:	8150	3	5	18	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  0  0  0  4  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 179 #######################


> Neighbours evaluated; 31
> Selected Move:	8068	3	6	5	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  0  0  0  4  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 180 #######################


> Neighbours evaluated; 65
> Selected Move:	8110	3	16	8	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  0  0  0  4  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 181 #######################


> Neighbours evaluated; 68
> Selected Move:	8110	3	18	12	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  1  0  0  4  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 182 #######################


> Neighbours evaluated; 82
> Selected Move:	8110	3	7	6	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  1  0  1  0  0  4  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 183 #######################


> Neighbours evaluated; 82
> Selected Move:	8110	3	6	19	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  0  1  0  0  4  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 184 #######################


> Neighbours evaluated; 27
> Selected Move:	8050	3	12	7	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  0  0  0  4  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 185 #######################


> Neighbours evaluated; 70
> Selected Move:	8068	3	5	18	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  0  0  0  4  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,3

## ITERATION 186 #######################


> Neighbours evaluated; 65
> Selected Move:	8040	3	19	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  0  0  0  4  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 187 #######################


> Neighbours evaluated; 30
> Selected Move:	8035	3	8	19	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  0  0  0  4  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 188 #######################


> Neighbours evaluated; 60
> Selected Move:	8030	3	16	12	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  4  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 189 #######################


> Neighbours evaluated; 75
> Selected Move:	8030	3	19	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  1  0  0  4  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 190 #######################


> Neighbours evaluated; 50
> Selected Move:	8010	3	15	17	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  1  0  0  0  0  4  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 191 #######################


> Neighbours evaluated; 32
> Selected Move:	7963	3	6	4	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  0  1  0  0  0  0  4  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 192 #######################


> Neighbours evaluated; 28
> Selected Move:	7990	3	17	3	24900


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 193 #######################


> Neighbours evaluated; 39
> Selected Move:	8060	3	4	8	24400


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  1  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 194 #######################


> Neighbours evaluated; 35
> Selected Move:	8050	3	3	16	24600


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  0  4  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 195 #######################


> Neighbours evaluated; 27
> Selected Move:	8050	4	16	18	24200


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  0  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 196 #######################


> Neighbours evaluated; 31
> Selected Move:	8105	3	16	15	25700


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  1  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 197 #######################


> Neighbours evaluated; 35
> Selected Move:	8012	3	18	5	25400


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 198 #######################


> Neighbours evaluated; 72
> Selected Move:	8050	3	15	19	24400


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  1  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 199 #######################


> Neighbours evaluated; 69
> Selected Move:	8050	4	5	19	24400


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  1  0  0  0  0  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 200 #######################


> Neighbours evaluated; 68
> Selected Move:	8027	4	19	8	25100


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  4  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 201 #######################


> Neighbours evaluated; 60
> Selected Move:	8005	4	8	10	25200


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  4  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 202 #######################


> Neighbours evaluated; 66
> Selected Move:	8006	3	8	16	25700


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  4  0  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 203 #######################


> Neighbours evaluated; 64
> Selected Move:	8103	3	19	6	25700


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0  4  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 204 #######################


> Neighbours evaluated; 63
> Selected Move:	8084	3	5	18	26200


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  4  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 205 #######################


> Neighbours evaluated; 18
> Selected Move:	8113	3	10	13	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  0  0  1  4  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 206 #######################


> Neighbours evaluated; 65
> Selected Move:	8070	3	18	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0  0  0  1  4  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 207 #######################


> Neighbours evaluated; 72
> Selected Move:	8070	3	6	19	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  4  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25
________________________________________________________________

Best solution found: 8370
Run Termination time: 03.02.2010 21:24:38
Run duration: 00:01:37.2500000
________________________________________________________________
